Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects
نویسنده
چکیده
Recently, several methods have been proposed for optimal delete-free planning. We present an incremental compilation approach that enables these methods to be applied to problems with conditional effects, which none of them support natively. With an h solver for problems with conditional effects in hand, we also consider adapting the h anytime lower bound function to use the more spaceefficient P ce compilation. This avoids the memory limitation of the original h caused by its reliance on an exponential-space compilation. It also leads to improvements on some problems where memory is not an issue.
منابع مشابه
Semi-Relaxed Plan Heuristics
Heuristics based on the delete relaxation are at the forefront of modern domain-independent planning techniques. Here we introduce a principled and flexible technique for augmenting delete-relaxed tasks with a limited amount of delete information, by introducing special fluents that explicitly represent conjunctions of fluents in the original planning task. Differently from previous work in thi...
متن کاملImproving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions
Heuristic functions based on the delete relaxation compute upper and lower bounds on the optimal delete-relaxation heuristic h, and are of paramount importance in both optimal and satisficing planning. Here we introduce a principled and flexible technique for improving h, by augmenting delete-relaxed planning tasks with a limited amount of delete information. This is done by introducing special...
متن کاملRed-Black Relaxed Plan Heuristics Reloaded
Despite its success, the delete relaxation has significant pitfalls. In an attempt to overcome these pitfalls, recent work has devised so-called red-black relaxed plan heuristics, where red variables take the relaxed semantics (accumulating their values), while black variables take the regular semantics. These heuristics were shown to significantly improve over standard delete relaxation heuris...
متن کاملOn the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning
When planning for tasks that feature both state-dependent action costs and conditional effects using relaxation heuristics, the following problem appears: handling costs and effects separately leads to worse-than-necessary heuristic values, since we may get the more useful effect at the lower cost by choosing different values of a relaxed variable when determining relaxed costs and relaxed acti...
متن کاملComputation of h with Factored Planning
The main approach for classical planning is heuristic search. Many cost heuristics are based on the delete relaxation. The optimal heuristic of a delete free planning problem is called h. This thesis explores two new ways to compute h. Both approaches use factored planning, which decomposes the original planning problem to work on each subproblem separately. The algorithm reuses the subsolution...
متن کامل